New Approach to Compute Integral Transforms
نویسندگان
چکیده
منابع مشابه
A new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولHenstock-Kurzweil Integral Transforms
Copyright q 2012 Salvador Sánchez-Perales et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We show conditions for the existence, continuity, and differentiability of functions defined by ΓΓs ∞ −∞ ftgt, sdt, where f is a func...
متن کاملNew approach to a generalized fractional integral
The paper presents a new fractional integration, which generalizes the Riemann-Liouville and Hadamard fractional integrals into a single form, which when a parameter fixed at different values, produces the above integrals as special cases. Conditions are given for such a generalized fractional integration operator to be bounded in an extended Lebesgue measurable space. Semigroup property for th...
متن کاملa new approach to compute acyclic chromatic index of certain chemical structures
an acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. the acyclic chromatic index of a graph $g$ denoted by $chi_a '(g)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. the maximum degree in $g$ denoted by $delta(g)$, is the lower bound for $chi_a '(g)$. $p$-cuts introduced in this paper acts as a powerfu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Statistics
سال: 2008
ISSN: 1549-3644
DOI: 10.3844/jmssp.2008.94.97